A Simple Optimum-Time FSSP Algorithm for Multi-Dimensional Cellular Automata
نویسندگان
چکیده
منابع مشابه
A Simple Optimum-Time FSSP Algorithm for Multi-Dimensional Cellular Automata
The firing squad synchronization problem (FSSP) on cellular automata has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed for not only one-dimensional arrays but two-dimensional arrays. In the present paper, we propose a simple recursive-halving based optimum-time synchronization algorithm that can synchronize any rectangle ...
متن کاملA Survey on Optimum-Time Firing Squad Synchronization Algorithms for One-Dimensional Cellular Automata
The firing squad synchronization problem has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed. In the present paper, we examine the state transition rule sets for the famous firing squad synchronization algorithms that give a finite-state protocol for synchronizing large-scale cellular automata and present a comparative stud...
متن کاملA CELLULAR AUTOMATA BASED FIREFLY ALGORITHM FOR LAYOUT OPTIMIZAION OF TRUSS STRUCTURES
In this study an efficient meta-heuristic is proposed for layout optimization of truss structures by combining cellular automata (CA) and firefly algorithm (FA). In the proposed meta-heuristic, called here as cellular automata firefly algorithm (CAFA), a new equation is presented for position updating of fireflies based on the concept of CA. Two benchmark examples of truss structures are presen...
متن کاملEvolving Transition Rules for Multi Dimensional Cellular Automata
Genetic Algorithms have been used before to evolve transition rules for one dimensional Cellular Automata (CA) to solve e.g. the majority problem and investigate communication processes within such CA [3]. In this paper, the principle is extended to multi dimensional CA, and it is demonstrated how the approach evolves transition rules for the two dimensional case with a von Neumann neighborhood...
متن کاملA Maze Routing Algorithm Based on Two Dimensional Cellular Automata
This paper propose a maze routing algorithm based on cellular automata. The aim of this algorithm is find the shortest path between the source cell and the target cell , so that the path does not pass from the obstacles. Algorithm has two phases, exploration and retrace. In exploration phase a wave is expanded from source cell and it puts token on cells which it passes via them while expanding....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2012
ISSN: 2075-2180
DOI: 10.4204/eptcs.90.13